搜索资源列表
digui-binary-tree
- 利用递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Recursive way to operate on a binary tree such as the first post-order traversal sequence in order
traversal-of-binary-tree
- 二叉树的三种遍历的C#实现 能够在.net环境下执行-binary tree traversal traversal of binary tree
Rebuild-binary-tree
- Rebuild binary tree 根据输入的二叉树前序和中序遍历序列重构二叉树，输出对应节点的左右子节点。-Rebuild binary tree
binary-tree
- 二叉树的建立与遍历，非常适合初学者，纯属个人出品，-The establishment and traverse binary tree, very suitable for beginners, produced purely personal,
binary-tree
- 二叉树也是递归定义的，其结点有左右子树之分，逻辑上二叉树有五种基本形态： (1)空二叉树——(a)； (2)只有一个根结点的二叉树——(b)； (3)右子树为空的二叉树——(c)； (4)左子树为空的二叉树——(d)； (5)完全二叉树——(e)注意：尽管二叉树与树有许多相似之处，但二叉树不是树的特殊情形-Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic
The-basic-operation-of-a-binary-tree
- 二叉树的基本操作 二叉树的基本操作 -The basic operation of a binary tree binary tree binary tree the basic operation of the basic operation of the basic operation of a binary tree
BINARY-TREE
- this is a binary tree, is made in visual studio c + +, I hope you dear users served.
Binary-Tree
- 自己输入一个二叉树，再分别用前序、中序、后序法遍历这个二叉树。-Input a binary tree, and then were used to pre-order, in order, after the sequential traversal of this binary tree.
binary-tree
- 二叉树 二叉树 二叉树 二叉树 二叉树 二叉树 二叉树-binary tree
Implementation-of-binary-tree
- 这个程序很好的介绍了二叉树的实现方法-Good introduction to the program implementation of binary tree method ~ ~
binary-tree
- 实现二叉树的各种遍历，层次遍历，先序遍历，后序遍历等-Realize all kinds of a binary tree traverse, LevelOrder Traverse , preorder traversal ,postorder traversal
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
a-binary-tree
- 在采用链式存储结构的二叉树上，以bt指向根结点，p指向任一给定的结点，编程实现求出从根结点到给定结点之间的路径。主要是对二叉树的存储结构及其在二叉链表树上的各种操作加深理解。-The introduction of chain stores on the binary tree structure to point to the root bt, p point to any given node, programming derived from the root to the given p
Binary-Tree-levorder
- 用C++实现二叉树中的层次遍历（Binary_tree.cpp中），levorder，用的是队列-Use C++ achieve the the hierarchical traversal (Binary_tree.cpp) binary tree, levorder, the queue
Balanced-binary-tree
- 手动输入数据，加入到二叉树中，并生成平衡二叉树，对学习C++及数据结构有较大帮助-Manually input data into the binary tree, and generate a balanced binary tree, to learn C++ and data structures have more help
Binary-tree
- 给出二叉树的中序和前序或中序和后序回复树并输出-Binary tree in the order given in the preamble or in the order and return after the tree and the output sequence
Binary-Tree
- 实现了二叉树的四种遍历算法，先序遍历，中序遍历，后序遍历，层次遍历，另带有Word文档，其中有程序示例图-Achieved four binary tree traversal algorithm, the first traversal, inorder traversal, postorder traversal, level walk, and the other with a Word document, including procedures for sample map
traversing-binary-tree
- 非递归遍历二叉树Non - recursive traversing binary tree Non - recursive traversing binary tree Non - recursive traversing binary tree -Non- recursive traversing binary tree
binary-tree
- 1) 用先序递归过程建立二叉树（存储结构：二叉链表） 输入数据按先序遍历所得序列输入，当某节点左子树或右子树为空时，输入‘*’号，如输入abc**d**e** 2) 编写递归算法，计算二叉树中叶子结点的数目。 3）按凹入表方式输出该二叉树。 -1) The process established by the first order recursive binary tree (memory structure: binary list) input data sequen
some-of-the-binary-tree-algorithm.
- 实现二叉树的一些算法，超级经典的算法，各种函数功能的实现-To achieve some of the binary tree algorithm, super-classic algorithm, the realization of various functions functions